Beagle - A Hierarchic Superposition Theorem Prover
نویسندگان
چکیده
Beagle is an automated theorem prover for first-order logic modulo built-in theories. It implements a refined version of the hierarchic superposition calculus. This system description focuses on Beagle’s proof procedure, background reasoning facilities, implementation, and experimental results.
منابع مشابه
Hierarchic Superposition: Completeness without Compactness
Many applications of automated deduction and verification require reasoning in combinations of theories, such as, on the one hand (some fragment of) first-order logic, and on, the other hand a background theory, such as some form of arithmetic. Unfortunately, due to the high expressivity of the full logic, complete reasoning is impossible in general. It is a realistic goal, however, to devise t...
متن کاملSuperposition as a Decision Procedure for Timed Automata
The success of superposition-based theorem proving in first-order logic relies in particular on the fact that the superposition calculus is able to decide well-known classical decidable fragments of first-order logic and has been successful in identifying new decidable classes. In this paper, we extend this story to the hierarchic combination of linear arithmetic and first-order superposition. ...
متن کاملHierarchic Superposition with Weak Abstraction
Many applications of automated deduction require reasoning in first-order logic modulo background theories, in particular some form of integer arithmetic. A major unsolved research challenge is to design theorem provers that are “reasonably complete” even in the presence of free function symbols ranging into a background theory sort. The hierarchic superposition calculus of Bachmair, Ganzinger,...
متن کاملCooperation Between Top-Down and Bottom-Up Theorem Provers by Subgoal Clause Transfer
Top-down and bottom-up theorem proving approaches have each specific advantages and disadvantages. Bottom-up provers profit from strong redundancy control and suffer from the lack of goal-orientation, whereas top-down provers are goal-oriented but have weak calculi when their proof lengths are considered. In order to integrate both approaches our method is to achieve cooperation between a top-d...
متن کاملCooperation between Top - Down and Bottom
Top-down and bottom-up theorem proving approaches have each speciic advantages and disadvantages. Bottom-up provers proot from strong redundancy control and suuer from the lack of goal-orientation, whereas top-down provers are goal-oriented but have weak calculi when their proof lengths are considered. In order to integrate both approaches our method is to achieve cooperation between a top-down...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015